Binary search Algorithm

 

#include<bits/stdc++.h>

using namespace std;

main()

{

    int n,i,iteam;

    cout<<"Entet your array size : ";

    cin>>n;

    int a[n];

    cout<<"Entet your array element : ";

    for(i=0;i<n;i++) cin>>a[i];

    cout<<"Enter your search iteam : ";

    cin>>iteam;

    int left,right,middle;

    left=0;

    right=n-1;

    while(left<=right)

    {

         middle=(left+right)/2;

         if(a[middle]==iteam)

         {

             cout<<"Iteam found "<<endl;

             return 0;

         }

         else if(a[middle]<iteam) left=middle+1;

         else right=middle-1;

    }

    cout<<"iteam not found"<<endl;

    return 0;

}